Computable scott sentences for quasi–Hopfian finitely presented structures

نویسندگان

چکیده

We prove that every quasi-Hopfian finitely presented structure A has a d- $$\Sigma _2$$ Scott sentence, and if in addition is computable Aut(A) satisfies natural condition, then sentence. This unifies several known results on sentences of structures it used to other not previously considered algebraic interest have sentences. In particular, we show right-angled Coxeter group finite rank as well any strongly rigid rank. Finally, the free projective plane 4 thus exhibiting example where assumption quasi-Hopfianity (since this Hopfian).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Exact Sequence and Finitely Presented Modules

The notion of quasi-exact sequence of modules was introduced by B. Davvaz and coauthors in 1999 as a generalization of the notion of exact sequence. In this paper we investigate further this notion. In particular, some interesting results concerning this concept and torsion functor are given.

متن کامل

Finitely Presented Infinite Graphs

This thesis contributes to the study of families of finitely presented infinite graphs,their structural properties and their relations to each other. Given a finite alpha-bet Σ, a Σ-labeled infinite graph can be characterized as a finite set of binaryrelations (Ra)a∈Σ over an arbitrary countable domain V . There are many ways tofinitely characterize such sets of relations, eithe...

متن کامل

Finitely Presented Heyting Algebras

In this paper we study the structure of finitely presented Heyting algebras. Using algebraic techniques (as opposed to techniques from proof-theory) we show that every such Heyting algebra is in fact coHeyting, improving on a result of Ghilardi who showed that Heyting algebras free on a finite set of generators are co-Heyting. Along the way we give a new and simple proof of the finite model pro...

متن کامل

Finitely-Verifiable Classes of Sentences

This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sentences is finitely-verifiable if whether a sentence in this class is a theorem of a given theory can be checked with respect to a finite set of models of the theory. The usefulness of this notion is illustrated using examples from arithmetics, first-order logic, game theory, and planning.

متن کامل

Finitely Presented Residually Free Groups

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archive for Mathematical Logic

سال: 2022

ISSN: ['1432-0665', '0933-5846']

DOI: https://doi.org/10.1007/s00153-022-00833-7